An adaptive mesh redistribution method for nonlinear Hamilton-Jacobi equations in two- and three-dimensions
نویسندگان
چکیده
This paper presents an adaptive mesh redistribution (AMR) method for solving the nonlinear Hamilton-Jacobi equations and level set equations in twoand threedimensions. Our approach includes two key ingredients: a non-conservative secondorder interpolation on the updated adaptive grids, and a class of monitor functions (or indicators) suitable for the Hamilton-Jacobi problems. The proposed adaptive mesh methods transform a uniform mesh in the logical domain to cluster grid points at the regions of the physical domain where the solution or its derivative is singular or nearly singular. Moreover, the formal second-order rate of convergence is preserved for the proposed AMR methods. Extensive numerical experiments are performed to demonstrate the efficiency and robustness of the proposed adaptive mesh algorithm.
منابع مشابه
L1-Approximation of Stationary Hamilton-Jacobi Equations
We describe a nonlinear finite element technique to approximate the solutions of stationary Hamilton-Jacobi equations in two space dimensions using continuous finite elements of arbitrary degree. The method consists of minimizing a functional containing the L-norm of the Hamiltonian plus a discrete entropy. It is shown that the approximate sequence converges to the unique viscosity solution und...
متن کاملL-approximation of Stationary Hamilton–jacobi Equations∗
We describe a nonlinear finite element technique to approximate the solutions of stationary Hamilton–Jacobi equations in two space dimensions using continuous finite elements of arbitrary degree. The method consists of minimizing a functional containing the L1-norm of the Hamiltonian plus a discrete entropy. It is shown that the approximate sequence converges to the unique viscosity solution un...
متن کاملAn h-Adaptive Runge-Kutta Discontinuous Galerkin Method for Hamilton-Jacobi Equations
In [35,36], we presented an h-adaptive Runge-Kutta discontinuous Galerkin method using troubled-cell indicators for solving hyperbolic conservation laws. A tree data structure (binary tree in one dimension and quadtree in two dimensions) is used to aid storage and neighbor finding. Mesh adaptation is achieved by refining the troubled cells and coarsening the untroubled "children". Extensive num...
متن کاملAn adaptive high-order discontinuous Galerkin method with error control for the Hamilton-Jacobi equations. Part I: The one-dimensional steady state case
We propose and study an adaptive version of the discontinuous Galerkin method for Hamilton–Jacobi equations. It works as follows. Given the tolerance and the degree of the polynomial of the approximate solution, the adaptive algorithm finds a mesh on which the approximate solution has an L1-distance to the viscosity solution no bigger than the prescribed tolerance. The algorithm uses three main...
متن کاملAn Adaptive Sparse Grid Semi-Lagrangian Scheme for First Order Hamilton-Jacobi Bellman Equations
We propose a semi-Lagrangian scheme using a spatially adaptive sparse grid to deal with non-linear time-dependent Hamilton-Jacobi Bellman equations. We focus in particular on front propagation models in higher dimensions which are related to control problems. We test the numerical efficiency of the method on several benchmark problems up to space dimension d = 8, and give evidence of convergenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002